Discrete Time Modeling of the Frame Based Generic Cell Rate Algorithm
نویسنده
چکیده
The Guaranteed Frame Rate service recently de ned by the ATM Forum allows users to send data in excess of their guaranteed service rate but only guarantees that such tra c will be delivered within the limits of available network resources that is it is transported on best e ort In order to distinguish tra c sent in line with the guaranteed service rate from tra c sent in excess a frame based version of the Generic Cell Rate Algorithm is employed This paper presents an analytical approach that forms the basis for dimen sioning tra c descriptors related to the Frame Based Generic Cell Rate Algorithm The approach is based on a discrete time analysis technique
منابع مشابه
On the Design of Nonlinear Discrete-Time Adaptive Controller for damaged Airplane
airplane in presence of asymmetric left-wing damaged. Variations of the aerodynamic parameters, mass and moments of inertia, and the center of gravity due to damage are all considered in the nonlinear mathematical modeling. The proposed discrete-time nonlinear MRAC algorithm applies the recursive least square (RLS) algorithm as a parameter estimator as well as the error between the real ...
متن کاملPerformance of the GFR-Service with Constant Available Bandwidth
Recently the ATM Forum defined the Guaranteed Frame Rate service category to provide a minimum service guarantee to classical best-effort services. The eligibility of frames for this service category is determined with the Frame Based Generic Cell Rate Algorithm and the transmission is guaranteed by a queuing-discipline based on two thresholds. In this paper we present a discrete-time analysis ...
متن کاملModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملA New Multi-objective Model for Multi-mode Project Planning with Risk
The purpose of this problem is to choose a set of project activities for crashing, in a way that the expected project time, cost and risk are minimized and the expected quality is maximized. In this problem, each project activity can be performed with a specific executive mode. Each executive mode is characterized with four measures, namely the expected time, cost, quality and risk. In this pap...
متن کاملPARTICLE SWARM-GROUP SEARCH ALGORITHM AND ITS APPLICATION TO SPATIAL STRUCTURAL DESIGN WITH DISCRETE VARIABLES
Based on introducing two optimization algorithms, group search optimization (GSO) algorithm and particle swarm optimization (PSO) algorithm, a new hybrid optimization algorithm which named particle swarm-group search optimization (PS-GSO) algorithm is presented and its application to optimal structural design is analyzed. The PS-GSO is used to investigate the spatial truss structures with discr...
متن کامل